基于PG图的空间信息服务链建模方法

空间数据的异构、分布与海量的固有特点导致了空间信息应用的分布与难于集成的现状,成为制约空间数据大规模应用的主要因素。根据服务链的思想,提出了基于PG(优先图)构造服务链图进行空间数据应用集成建模的方法,并定义了一组变换实现对模型的逐步精化和向现实模型转化。该方法在面向资源环境的空间信息应用服务中进行了初步应用。     

Optimal staffing in nonstationary service centers with constraints

This paper considers optimal staffing in service centers. We construct models for profit and cost centers using dynamic rate queues. To allow for practical optimal controls, we approximate the queueing process using a Gaussian random variable with equal mean and variance. We then appeal to the Pontryagin's maximum principle to derive a closed form square root staffing (SRS) rule for optimal staffing. Unlike most traditional SRS formulas, the main parameter in our formula is not the probability of delay but rather a cost‐to‐benefit ratio that depends on the shadow price. We show that the delay experienced by customers can be interpreted in terms of this ratio. Throughout the article, we provide theoretical support of our analysis and conduct extensive numerical experiments to reinforce our findings. To this end, various scenarios are considered to evaluate the change in the staffing levels as the cost‐to‐benefit ratio changes. We also assess the change in the service grade and the effects of a service‐level agreement constraint. Our analysis indicates that the variation in the ratio of customer abandonment over service rate particularly influences staffing levels and can lead to drastically different policies between profit and cost service centers. Our main contribution is the introduction of new analysis and managerial insights into the nonstationary optimal staffing of service centers, especially when the objective is to maximize profitability. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 615–630, 2017     

嵌入式浏览器中SSL的设计与实现

针对嵌入式浏览器信息传输的安全性问题和嵌入式软件的特点,介绍了SSL协议,提出了一种在嵌入式浏览器中实现对SSL协议支持的方法.通过分析影响SSL协议客户端性能的因素,对SSL的实现过程进行了适当的优化,使用会话恢复机制、只对服务器进行验证的简单握手模式、减少TCP调用次数和优化对批量数据加密算法等方法,实现了嵌入式浏览器对SSL协议的支持;并介绍了方法在嵌入式浏览器JARI_Browser中的实现过程.实际的应用验证了该方法的可行性和正确性.     

灰色-马尔科夫模型在机场道面使用性能预测中的应用

介绍利用灰色-马尔科夫模型对机场道面使用性能进行预测的基本方法和具体步骤,并给出了工程实例.应用分析表明,该方法能够充分利用机场道面使用中各段历史数据,较好地对机场道面使用性能进行预测,且预测结果比单纯的灰色模型有更高的精度.     

北斗RDSS系统新体制信号子载波间干扰产生机理与消除方法

为提高新一代北斗无线电测定卫星服务在有限带宽内的信息服务容量，借鉴了正交频分复用的理念，新体制无线电测定卫星服务信号设计采用多个子载波进行信号调制。以往针对多用户的分析主要考虑多址干扰，对载波频偏损耗和伪码损耗单独考虑，这不能解释新体制调制在相同的同步头的情况下其他子载波上信号在当前观测子载波上形成较大相关峰的问题，该问题对信号接收产生较大干扰。本文对该问题产生机理进行了分析，并提出了两种相关干扰的消除方法。     

一种基于灰关联分析的QoS服务选择方法

随着网络中可供选择QoS服务日益增多,在用户请求服务时,为了确保用户获得满足其功能与QoS要求的服务,提出了一种基于灰关联分析的QoS服务选择方法,根据用户对网络服务的QoS需求估计各项QoS指标的主观权重,以用户的偏好感知作为服务选择的约束条件;基于候选服务集合构建候选服务决策矩阵,采用灰关联分析方法从中获得用户QoS满意度最高的服务。仿真和分析表明,该服务选择策略能为服务质量敏感的用户提供有效的满足QoS需求的服务方案。     

一个新的求解单节点并联供水系统的数学模型

对单节点并联供水系统直接用伯努利方程、管道阻力特性和节点连续性方程建立了求解工况参数的一个新的数学模型,讨论了其解,列举了实际应用。     

Price and capacity decisions of service systems with boundedly rational customers

We consider price and capacity decisions for a profit‐maximizing service provider in a single server queueing system, in which customers are boundedly rational and decide whether to join the service according to a multinomial logit model. We find two potential price‐capacity pair solutions for the first‐order condition of the profit‐maximizing problem. Profit is maximized at the solution with a larger capacity, but minimized at the smaller one. We then consider a dynamically adjusting capacity system to mimic a real‐life situation and find that the maximum can be reached only when the initial service rate is larger than a certain threshold; otherwise, the system capacity and demand shrink to zero. We also find that a higher level of customers’ bounded rationality does not necessarily benefit a firm, nor does it necessarily allow service to be sustained. We extend our analysis to a setting in which customers’ bounded rationality level is related to historical demand and find that such a setting makes service easier to sustain. Finally we find that bounded rationality always harms social welfare.     

地方高校图书馆主动服务对军校图书馆的启示——对全国15所重点高校图书馆网站的调查与分析

从图书馆主动服务的理念入手,探讨利用网络开展主动服务的可能性,并结合对全国15所重点高校图书馆网站和实践开展的多种主动服务方式进行调查统计,分析总结其特点,由此得出对军校图书馆开展主动服务的启示。     

Formulations for dynamic lot sizing with service levels

In this article, we study deterministic dynamic lot‐sizing problems with a service‐level constraint on the total number of periods in which backlogs can occur over a finite planning horizon. We give a natural mixed integer programming formulation for the single item problem (LS‐SL‐I) and study the structure of its solution. We show that an optimal solution to this problem can be found in \begin{align*}\mathcal O(n^2\kappa)\end{align*} time, where n is the planning horizon and \begin{align*}\kappa=\mathcal O(n)\end{align*} is the maximum number of periods in which demand can be backlogged. Using the proposed shortest path algorithms, we develop alternative tight extended formulations for LS‐SL‐I and one of its relaxations, which we refer to as uncapacitated lot sizing with setups for stocks and backlogs. {We show that this relaxation also appears as a substructure in a lot‐sizing problem which limits the total amount of a period's demand met from a later period, across all periods.} We report computational results that compare the natural and extended formulations on multi‐item service‐level constrained instances. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013